The use of CFD modelling to optimise measurement of overflow rates in a downstream-controlled dual-overflow structure

The measurement of the flow through complex combined sewer overflow structures in the frame of automated monitoring remains difficult. In this paper, a methodology based on the use of computational fluid dynamics (CFD) modelling in order to improve the instrumentation of a downstream-controlled dual-overflow structure is presented. The dual-overflow structure is composed of two combined sewer overflows (CSOs) connected by a rectangular channel and controlled by a downstream gate located at the entry of the Meyzieu waste water treatment plant (close to Lyon, France). The analysis of the CFD results provides: (i) a better understanding of the interaction between the two CSOs--that means the hydraulic operation, the hydrodynamic behaviour, the backflow effect--and (ii) an ability to optimise the location of the water depth sensor. The measured water depth is used to assess the overflow rate by means of a numerical relationship. Uncertainties are also assessed.     

Parallel best-first search algorithms for planning problems on multi-core processors

The Journal of Supercomputing - The multiplication of computing cores in modern processor units permits revisiting the design of classical algorithms to improve computational performance in complex...     

Metallic Conductive Nanowires Elaborated by PVD Metal Deposition on Suspended DNA Bundles

Metallic conductive nanowires (NWs) with DNA bundle core are achieved, thanks to an original process relying on double‐stranded DNA alignment and physical vapor deposition (PVD) metallization steps involving a silicon substrate. First, bundles of DNA are suspended with a repeatable process between 2 µm high parallel electrodes with separating gaps ranging from 800 nm to 2 µm. The process consists in the drop deposition of a DNA lambda‐phage solution on the electrodes followed by a naturally evaporation step. The deposition process is controlled by the DNA concentration within the buffer solution, the drop volume, and the electrode hydrophobicity. The suspended bundles are finally metallized with various thicknesses of titanium and gold by a PVD e‐beam evaporation process. The achieved NWs have a width ranging from a few nanometers up to 100 nm. The electrical behavior of the achieved 60 and 80 nm width metallic NWs is shown to be Ohmic and their intrinsic resistance is estimated according to different geometrical models of the NW section area. For the 80 nm width NWs, a resistance of about few ohms is established, opening exploration fields for applications in microelectronics.     

Packing spherical discrete elements for large scale simulations

We introduce a new geometric method to generate sphere packings with restricted overlap values. Sample generation is an important, but time-consuming, step that precedes a calculation performed with the discrete element method (DEM). At present, there does not exist any software dedicated to DEM which would be similar to the mesh software that exists for finite element methods (FEM). A practical objective of the method is to build very large sphere packings (several hundreds of thousands) in a few minutes instead of several days as the current dynamic methods do. The developed algorithm uses a new geometric procedure to position very efficiently the polydisperse spheres in a tetrahedral mesh. The algorithm, implemented into YADE-OPEN DEM (open-source software), consists in filling tetrahedral meshes with spheres. In addition to the features of the tetrahedral mesh, the input parameters are the minimum and maximum radii (or their size ratio), and the magnitude of authorized overlaps. The filling procedure is stopped when a target solid fraction or number of spheres is reached. Based on this method, an efficient tool can be designed for DEMs used by researchers and engineers. The generated packings can be isotropic and the number of contacts per sphere is very high due to its geometric procedure. In this paper, different properties of the generated packings are characterized and examples from real industrial problems are presented to show how this method can be used. The current C++ version of this packing algorithm is part of YADE-OPEN DEM [20] available on the web (https://yade-dem.org).     

Deliberate word access: an intuition,a roadmap and some preliminary empirical results

No doubt, words play a major role in language production, hence finding them is of vital importance, be it for writing or for speaking (spontaneous discourse production, simultaneous translation). Words are stored in a dictionary, and the general belief holds, the more entries the better. Yet, to be truly useful the resource should contain not only many entries and a lot of information concerning each one of them, but also adequate navigational means to reveal the stored information. Information access depends crucially on the organization of the data (words) and the access keys (meaning/form), two factors largely overlooked. We will present here some ideas of how an existing electronic dictionary could be enhanced to support a speaker/writer to find the word s/he is looking for. To this end we suggest to add to an existing electronic dictionary an index based on the notion of association, i.e. words co-occurring in a well balanced corpus, the latter being supposed to represent the average citizen’s knowledge of the world. Before describing our approach, we will briefly take a critical look at the work being done by colleagues working on automatic, spontaneous or deliberate language production,—that is, computer-generated language, simulation of the mental lexicon, or WordNet (WN),—to see how adequate they are with regard to our goal.     

Recasting MLF

The language ML^F is a proposal for a new type system that supersedes both ML and System F, allows for efficient, predictable, and complete type inference for partially annotated terms. In this work, we revisit the definition of ML^F, following a more progressive approach and focusing on the design-space and expressiveness. We introduce a Curry-style version iML^F of ML^F and provide an interpretation of iML^F types as instantiation-closed sets of Dash System-F types, from which we derive the definition of type-instance in iML^F. We give equivalent syntactic definition of the type-instance, presented as a set of inference rules. We also show an encoding of iML^F into the closure of Curry-style System F by let-expansion. We derive the Church-style version eML^F by refining types of iML^F so as to distinguish between given and inferred polymorphism. We show an embedding of ML in eML^F and a straightforward encoding of System F into eML^F.     

A method to select a successful interoperability solution through a simulation approach

Enterprise applications and software systems need to be interoperable in order to achieve seamless business across organizational boundaries and thus realize virtual networked organizations. Our proposition can be considered as an interoperability project selection approach and is based on three steps: (1) Modelling both collaborative business processes and potential related interoperability projects; (2) Evaluating the accessibility of each project regarding the current state of the organization; (3) Simulating each project and assessing the associated performance. These results are finally projected on a comparison matrix used as a decision support to select the most appropriate interoperability solution. An application case extracted from the French aerospace sector demonstrates the applicability and the benefits of the proposition.     

Finite element analysis on implicitly defined domains: An accurate representation based on arbitrary parametric surfaces

In this paper, we present some novel results and ideas for robust and accurate implicit representation of geometric surfaces in finite element analysis. The novel contributions of this paper are threefold: (1) describe and validate a method to represent arbitrary parametric surfaces implicitly; (2) represent arbitrary solids implicitly, including sharp features using level sets and boolean operations; (3) impose arbitrary Dirichlet and Neumann boundary conditions on the resulting implicitly defined boundaries. The methods proposed do not require local refinement of the finite element mesh in regions of high curvature, ensure the independence of the domain’s volume on the mesh, do not rely on boundary regularization, and are well suited to methods based on fixed grids such as the extended finite element method (XFEM). Numerical examples are presented to demonstrate the robustness and effectiveness of the proposed approach and show that it is possible to achieve optimal convergence rates using a fully implicit representation of object boundaries. This approach is one step in the desired direction of tying numerical simulations to computer aided design (CAD), similarly to the isogeometric analysis paradigm.     

Network State Estimation and Prediction for Real-Time Traffic Management

Advanced Traveler Information Systems (ATIS) and Advanced Traffic Management Systems (ATMS) have the potential to contribute to the solution of the traffic congestion problem. DynaMIT is a real-time system that can be used to generate guidance for travelers. The main principle on which DynaMIT is based is that information should be consistent, and user optimal. Consistency implies that the traffic conditions experienced by the travelers are consistent with the condition assumed in generating the guidance. To generate consistent user optimal information, DynaMIT performs two main functions: state estimation and prediction. A demand simulator and a supply simulator interact to perform these tasks. A case study demonstrates the value of the system.